One-to-One and One-to-Many Node-Disjoint Routing Algorithms for RTCC Networks

Recently, routing with disjoint paths has received much attention because disjoint paths have the advantages of efficiency and fault tolerance. On the other hand, RTCC network was studied, due to its favorable properties such as high degree of stability and resilience. In this paper we studied the oneto-one and one-to-many disjoint routings for RTCC network. The connectivity of a network is an important measure of fault tolerance, while the diameter represents the worst-case transmission delay between two arbitrary nodes. The wide diameter, fault diameter and Rabin number, which take connectivity, faults and parallel paths into consideration, are three generalizations of the diameter. We obtained these properties of RTCC network and by using them we showed that in the faulty situations, this network act very well in comparison with the situations free of any fault.